Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling
نویسندگان
چکیده
منابع مشابه
Schedulability Tests for Fixed Priority Scheduling
Tasks can be classi ed as either periodic which execute every some time units or vice versa as aperiodic. Sporadic tasks are a special case of aperiodic tasks which are guaranteed to have a minimum spacing between consecutive instances of the same task. Sporadic tasks sets can be handled by modeling them as periodic tasks and therefore we will concentrate on the former two types of tasks. Sched...
متن کاملA faster exact schedulability analysis for fixed-priority scheduling
Real-time scheduling for task sets has been studied, and the corresponding schedulability analysis has been developed. Due to the considerable overheads required to precisely analyze the schedulability of a task set (referred to as exact schedulability analysis), the trade-off between precision and efficiency is widely studied. Many efficient but imprecise (i.e., sufficient but not necessary) a...
متن کاملSchedulability analysis of fixed priority real-time systems with offsets
For a number of years, work has been performed in collaboration with industry to establish improved techniques for achieving and proving the system timing constraints. The specific requirements encountered during the course of this work for both uniprocessor and distributed systems indicate a need for an efficient mechanism for handling the timing analysis of task sets which feature offsets. Li...
متن کاملSchedulability and Priority Assignment for Multi-Segment Self-Suspending Real-Time Tasks under Fixed-Priority Scheduling
Self-suspension is becoming an increasingly prominent characteristic in real-time systems such as: (i) I/O-intensive systems (ii) multi-core processors, and (iii) computation offloading systems with coprocessors, like Graphics Processing Units (GPUs). In this paper, we study the schedulability of multisegment self-suspension tasks under fixed-priority scheduling, where the executions of a multi...
متن کاملSchedulability analysis of fixed-priority systems using timed automata
In classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks are released and computed with fixed rates periodically. To relax the stringent constraints on task arrival times, we propose to use timed automata to describe task arrival patterns. In a previous work, it is shown that the general schedulability checking problem for such models is a reachability proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.332